A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization

and Applied Analysis 3 Proof. Since f(x) defined in (2) belongs to the PDGstructured family and by Lemma 2.1 in [16] the Clarke subdifferential of F(x, ρ) at x can be formulated by ∂F (x, ρ) = ∂f (x) + ρ∂G (x) = ∂f (x) + ρ conv { ∇g j (x) | j ∈ J (x) ∪ {0}}

متن کامل

A Redistributed Proximal Bundle Method for Nonconvex Optimization

Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads to the question of whether proximal variants of bundle methods can be extended to a nonconvex setting. This work proposes an approach based on generating cutting-planes models, not of the objective function as most bund...

متن کامل

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

αBB: A global optimization method for general constrained nonconvex problems

A branch and bound global optimization method, BB, for general continuous optimization problems involving nonconvexities in the objective function and/or constraints is presented. The nonconvexities are categorized as being either of special structure or generic. A convex relaxation of the original nonconvex problem is obtained by (i) replacing all nonconvex terms of special structure (i.e. bil...

متن کامل

On a decomposition method for nonconvex global optimization

A rigorous foundation is presented for the decomposition method in nonconvex global optimization, including parametric optimization, partly convex, partly monotonic, and monotonic/linear optimization. Incidentally, some errors in the recent literature on this subject are pointed out and fixed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 2013

ISSN: 1085-3375,1687-0409

DOI: 10.1155/2013/376403